/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: wangxin
 * Date: 2024-12-18
 * Time: 19:40
 */
class TreeNode{
    public int val;
    public int bf=0;
    public TreeNode right;
    public TreeNode left;
    public TreeNode parent;
    public TreeNode(int val){
        this.val = val;
    }
}

public class MyAVLTree {
    public  TreeNode root ;
    public boolean insert(int val){
        TreeNode node = new TreeNode(val);
        if(root == null){
            root = node;
            return true;
        }
        TreeNode parent = null;
        TreeNode cur = root;
        while(cur != null){

            if(cur.val > val){
                parent = cur;
                cur = cur.left;
            }else if(cur.val == val){
                return false;
            }else{
                parent = cur;
                cur = cur.right;
            }
        }
        if(parent.val > val){
            parent.left = node;
        }else{
            parent.right = node;
        }
        node.parent = parent;
        cur = node;
        while(parent!=null){
            if(parent.right == cur){
                parent.bf++;
            }else{
                parent.bf--;
            }
            if(parent.bf == 0){
                break;
            }else if(parent.bf == 1||parent.bf == -1){
                cur = parent;
                parent = cur.parent;
            }else{
                if(parent.bf == 2){
                    if(cur.bf == 1){
                        rotateLeft(parent);
                    }else{
              rotateRL(parent);
                    }
                }else{
                    if(cur.bf == -1){
                        rotateRight(parent);
                    }else {
            rotateLR(parent);
                    }
                }
                break;
            }
        }
        return true;
    }
    public void rotateRight(TreeNode parent){
        TreeNode subL = parent.left;
        TreeNode subLR = subL.right;
        parent.left = subLR;
        subL.right = parent;
        if(subLR != null){
            subLR.parent = parent;
        }
        TreeNode pParent = parent.parent;
        parent.parent = subL;
        if(parent == root){
            root = subL;
            root.parent = null;
        }else{
            if(pParent.left == parent){
                pParent.left = subL;
            }else{
                pParent.right = subL;
            }
            subL.parent = pParent;
        }
        parent.bf = 0;
        subL.bf = 0;
    }
    public void rotateLeft(TreeNode parent){
        TreeNode subR = parent.right;
        TreeNode subRL = subR.left;
        parent.right = subRL;
        subR.left = parent;
        if(subRL!= null){
            subRL.parent = parent;
        }
        TreeNode pParent = parent.parent;
        parent.parent = subR;
        if(parent == root){
            root = subR;
            root.parent = null;
        }else{
            if(pParent.left == parent){
                pParent.left = subR;
            }else{
                pParent.right = subR;
            }
            subR.parent = pParent;
        }
        parent.bf = 0;
        subR.bf = 0;
    }
    public void rotateLR(TreeNode parent){
        TreeNode subL = parent.left;
        TreeNode subLR = subL.right;
        int bf = subLR.bf;
        rotateLeft(parent.left);
        rotateRight(parent);
        if(bf == -1){
            subL.bf = 0;
            subLR.bf = 0;
            parent.bf = 1;
        }else if(bf == 1){
            subL.bf = -1;
            subLR.bf = 0;
            parent.bf = 0;
        }
    }
    public void rotateRL(TreeNode parent){
        TreeNode subR = parent.right;
        TreeNode subRL = subR.left;
        int bf = subRL.bf;
        rotateRight(parent.right);
        rotateLeft(parent);
        if(bf == 1){
            parent.bf = -1;
            subR.bf = 0;
            subRL.bf = 0;
        }else if(bf == -1){
            parent.bf = 0;
            subR.bf = 1;
            subRL.bf = 0;
        }
    }
    public void inorder(TreeNode root){
        if(root == null){
            return;
        }
        inorder(root.left);
        System.out.println(root.val);
        inorder(root.right);
    }
    private int height(TreeNode root){
        if (root == null){
            return 0;
        }
        int leftH = height(root.left);
        int rightH = height(root.right);
        return leftH > rightH?leftH+1:rightH+1;
    }
    public boolean isBalance(TreeNode root){
        if (root == null){
            return true;
        }
        int leftH = height(root.left);
        int rightH = height(root.right);
        if(rightH-leftH != root.bf){
            System.out.println("这个节点"+root.val+"平衡因子异常"+root.bf);
            return false;
        }
       return Math.abs(leftH - rightH) <= 1&&isBalance(root.left)&&isBalance(root.right);

    }
}
